Algorithms for solving overdetermined systems of linear equations in the lp-metric, 0 < p < 1
نویسندگان
چکیده
منابع مشابه
Solving Overdetermined Systems in lp Quasi-Norms
The theory of compressed sensing has shown that sparse signals can be reconstructed exactly from remarkably few measurements by solving a nonconvex underdetermined lp-regularized quasi-norm problem via an iterative weighted least-squares problem. In this work, we consider the problem of recovering an input signal by solving a nonconvex overdetermined lp-regularized quasi-norm problem. In order ...
متن کاملScalable Parallel Algorithms for Solving Sparse Systems of Linear Equations∗
We have developed a highly parallel sparse Cholesky factorization algorithm that substantially improves the state of the art in parallel direct solution of sparse linear systems—both in terms of scalability and overall performance. It is a well known fact that dense matrix factorization scales well and can be implemented efficiently on parallel computers. However, it had been a challenge to dev...
متن کاملParallel p-Adic Method for Solving Linear Systems of Equations
We present a parallel algorithm for exact solution of an integer linear system of equations using the single modulus p-adic expansion technique. More speciically, we parallelize an algorithm of Dixon, and present our implementation results on a distributed-memory multiprocessor. The parallel algorithm presented here can be used together with the multiple moduli algorithms and parallel Chinese r...
متن کاملSolution to Overdetermined Linear Equations
It has been known for many years that a robust solution to an overdetermined system of linear equations Ax b is obtained by minimizing the L1 norm of the residual error. A correct solution x to the linear system can often be obtained in this way, in spite of large errors (outliers) in some elements of the (m n) matrix A and the data vector b. This is in contrast to a least squares solution, whe...
متن کاملEnclosing solutions of overdetermined systems of linear interval equations
A method for enclosing solutions of overdetermined systems of linear interval equations is described. Several aspects of the problem (algorithm, enclosure improvement, optimal enclosure) are studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1978
ISSN: 0021-9045
DOI: 10.1016/0021-9045(78)90033-3